Definitional Issues in Functional Encryption

نویسنده

  • Adam O'Neill
چکیده

We provide a formalization of the emergent notion of “functional encryption,” as well as introduce various security notions for it, and study relations among the latter. In particular, we show that indistinguishability and semantic security based notions of security are inequivalent for functional encryption in general; in fact, “adaptive” indistinguishability does not even imply “non-adaptive” semantic security. This is alarming given the large body of work employing (special cases of) the former. We go on to show, however, that in the “non-adaptive” case an equivalence does hold between indistinguishability and semantic security for what we call preimage sampleable schemes. We take this as evidence that for preimage sampleable schemes an indistinguishability based notion may be acceptable in practice. We show that some common functionalities considered in the literature satisfy this requirement.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Browse searchable encryption schemes: Classification, methods and recent developments

With the advent of cloud computing, data owners tend to submit their data to cloud servers and allow users to access data when needed. However, outsourcing sensitive data will lead to privacy issues. Encrypting data before outsourcing solves privacy issues, but in this case, we will lose the ability to search the data. Searchable encryption (SE) schemes have been proposed to achieve this featur...

متن کامل

On GCLA, Gisela, and MedView Studies in Declarative Programming with Application to Clinical Medicine

Using declarative programming a programmer should be able to concentrate on what a program should do without worrying to much about how it is done. To be able to advance declarative programming methodologies, real-world examples are needed that push the limits of the proposed programming techniques. In this thesis we focus on some aspects of declarative programming, mostly from an applied angle...

متن کامل

Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles

We strengthen the foundations of deterministic public-key encryption via definitional equivalencesand standard-model constructs based on general assumptions. Specifically we consider seven notions ofprivacy for deterministic encryption, including six forms of semantic security and an indistinguishabilitynotion, and show them all equivalent. We then present a deterministic scheme for...

متن کامل

Relations Among Notions of Non-malleability for Encryption

Since its introduction in the early 90’s, the notion of nonmalleability for encryption schemes has been formalized using a number of conceptually different definitional approaches—most notably, the “pragmatic” indistinguishability-based approach and the “semantical” simulation-based approach. We provide a full characterization of these approaches and consider their robustness under composition.

متن کامل

A Note on Declarative Programming Paradigms and the Future of Definitional Programming

We discuss some approaches to declarative programming including functional programming, various logic programming languages and extensions, and definitional programming. In particular we discuss the programmers need and possibilities to influence the control part of programs. We also discuss some problems of the definitional programming language GCLA and try to find directions for future resear...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IACR Cryptology ePrint Archive

دوره 2010  شماره 

صفحات  -

تاریخ انتشار 2010